A Systematic Review for Solving Flow Shop Scheduling Problem Using Differential Evolution Algorithm
نویسنده
چکیده
This paper uses a systematic literature review about the resolution of the Flow Shop Scheduling problem (FSP) using a Differential Evolution (DE) algorithm, in order to define the current state of the art, and to identify possible future works in that area. Research questions were first identified, and the search strategy identified 64 studies, after getting more information from the studies and applying exclusion and inclusion selection criteria only 48 studies were selected, and considered as primary studies for this research, this process was following the guidelines proposed by Kitchengam [19]. In addition to presenting our results, there are also some suggestions for future works in the filed based on the current systematic literature review. The obtained results give information about the initial population process which is commonly generated using random processes, and the processes used to create the new individuals in each generation of the algorithm. After the review, this paper suggests the research or proposal to use heuristic algorithms to generate initial individual and start the future generation individuals based on good individual solutions, this improvement will generate better solutions and increase the performance of the algorithm.
منابع مشابه
Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study
Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...
متن کامل